Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
61	One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2 Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2012-03-07 01:50:39 NP-complete problems Operations research Combinatorial optimization Parallel computing Mathematical optimization Parametric search Algorithm Dynamic programming Greedy algorithm Partition problem Distributed computing Approximation algorithm
62	CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-16 11:28:02 NP-complete problems Vertex cover Maximum cut Dynamic programming Algorithm Kernelization Approximation algorithm
63	A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨ Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2013-08-22 13:00:35 Graph theory Degree Multigraph Eulerian path Directed graph Bipartite graph Graph Travelling salesman problem Matching
64	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover
65	Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich Add to Reading List Source URL: paulduetting.com Language: English - Date: 2015-12-11 02:28:02 Operations research Approximation algorithm Randomized rounding Greedy algorithm Algorithm Relaxation Combinatorial auction Price of anarchy Linear programming Travelling salesman problem Integer programming Semidefinite programming
66	Approximation Quality of the Hypervolume Indicator Karl Bringmanna , Tobias Friedrichb a Max-Planck-Institut f¨ ur Informatik, Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:16 Computational complexity theory Approximation algorithm Multi-objective optimization Multiplicative inverse Optimization problem Asymptotic analysis
67	Tight Bounds for the Approximation Ratio of the Hypervolume Indicator Karl Bringmann1 and Tobias Friedrich2 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:12 Mathematical optimization Computational complexity theory Multi-objective optimization Approximation algorithm Approximation theory Pareto efficiency Valuation
68	On Cornacchia’s algorithm for solving the diophantine equation u2 + dv 2 = m F. Morain ∗† J.-L. Nicolas ‡ September 12, 1990 Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2008-02-13 07:49:18 QN Euclidean algorithm Diophantine approximation Coprime integers Diophantine equation
69	Bandwidth minimization algorithms Aleksei V. Fishkin∗ 1 Ren´e A. Sitters† Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2013-01-22 08:17:43 Operations research Mathematical optimization Bandwidth Approximation algorithm Single-machine scheduling
70	Approximation-Guided Evolutionary Multi-Objective Optimization Karl Bringmann1 , Tobias Friedrich1 , Frank Neumann2 , Markus Wagner2 Max-Planck-Institut f¨ur Informatik, Campus E1.4, 66123 Saarbr¨ucken, Germany 2 Schoo Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:26 Mathematical optimization Cybernetics Computational complexity theory Evolution Operations research Multi-objective optimization Algorithm Evolutionary algorithm Approximation algorithm CMA-ES Genetic algorithm Evolutionary computation

UPDATE